Representation for multiple right-hand sides

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deflated Hermitian Lanczos Methods for Multiple Right-Hand Sides

A deflated and restarted Lanczos algorithm to solve hermitian linear systems, and at the same time compute eigenvalues and eigenvectors for application to multiple right-hand sides, is described. For the first right-hand side, eigenvectors with small eigenvalues are computed while simultaneously solving the linear system. Two versions of this algorithm are given. The first is called Lan-DR and ...

متن کامل

IDR(s) for linear equations with multiple right-hand sides

for x, where A is a given n × n matrix, and b a given n-vector. We have many opportunities to solve linear equations with the same coefficient matrix and different right-hand sides (RHSs). Therefore, block Krylov subspace methods such as the block Bi-CG (Bl-BCG), block Bi-CGSTAB (Bl-BiCGSTAB) [2], block GMRES (Bl-GMRES) and block QMR (Bl-QMR) methods have been developed for solving block linear...

متن کامل

Deflation for inversion with multiple right-hand sides in QCD

Most calculations in lattice Quantum Chromodynamics (QCD) involve the solution of a series of linear systems of equations with exceedingly large matrices and a large number of right hand sides. Iterative methods for these problems can be sped up significantly if we deflate approximations of appropriate invariant spaces from the initial guesses. Recently we have developed eigCG, a modification o...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

The Total Least Squares Problem with Multiple Right-Hand Sides

The total least squares (TLS) techniques, also called orthogonal regression and errors-in-variables modeling, see [15, 16], have been developed independently in several areas. For a given linear (orthogonally invariant) approximation problem AX ≈ B, where A ∈ Rm×n, B ∈ Rm×d, X ∈ Rn×d, the TLS formulation aims at a solution of a modified problem (A + E)X = B + G such that min ‖[G,E]‖F . The alge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 1990

ISSN: 0025-5610,1436-4646

DOI: 10.1007/bf01588775